On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
نویسندگان
چکیده
Article history: Received 15 December 2014 Available online 2 March 2016
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملSAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
Formal methods among them the model checking techniques play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can ...
متن کاملVerification of Parameterized Communicating Automata via Split-Width
We study verification problems for distributed systems communicating via unbounded FIFO channels. The number of processes of the system as well as the communication topology are not fixed a priori. Systems are given by parameterized communicating automata (PCAs) which can be run on any communication topology of bounded degree, with arbitrarily many processes. Such systems are Turing powerful so...
متن کاملThe Complexity of Reversal-Bounded Model-Checking
We study model-checking problems on counter systems when the specification languages are LTL-like dialects with arithmetical constraints and the runs are restricted to reversal-bounded ones. To do so, we introduce a generalization of reversal-boundedness and we show the NExpTime-completeness of the reversal-bounded model-checking problem as well as for related reversal-bounded reachability prob...
متن کاملPerformance Guarantees for Distributed Reachability Queries
In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs. This paper proposes distributed evaluation algorithms for three classes of queries: reachability for determining whether one node can reach another, bounded reachability for deciding whether there exists a path of a bounded length between a...
متن کامل